Shallow Backtracking Points in an Intelligent Backtracking Schema
نویسنده
چکیده
منابع مشابه
Procedure Backtracking Points and Variable Ages in an Intelligent Backtracking Schema
We present a new method to represent variable bindings in the Warren Abstract Machine (WAM), so that ages of variable bindings can be easily found using this new representation in our intelligent backtracking schema. The age of a variable bound to a non-variable term will be the youngest choice point such that backtracking to that choice point can make that variable an unbound variable again. I...
متن کاملSelecting Choice Points in An Intelligent Backtracking Schema
We present a runtime intelligent backtracking method for prolog programs to avoid redundant failures The method presented in this paper selects the best choice point as a backtracking point during the failure of a procedure call to avoid the same failure The chosen backtracking is the best choice point that can be determined in runtime during execution of a goal without a further analysis The m...
متن کاملVariable Ages In A WAM Based System
We present a new method to represent variable bindings in the Warren Abstract Machine WAM so that ages of variable bindings can be easily found using this new representation The age of a variable bound to a ground term will be the youngest choice point such that backtracking to that choice point can make that variable an unbound variable again In other words the age of a variable bound to a gro...
متن کاملFinding Connict Sets and Backtrack Points in Clp(<)
This paper presents a method for intelligent backtracking in CLP(<). Our method integrates a depth-rst intelligent backtracking algorithm developed for logic programming with an original constraint satisfaction algorithm which naturally generates sets of connicting constraints. We prove that if CLP(<) is assumed to cover strictly the domain of real numbers, then the constraint satisfaction algo...
متن کاملDynamic Backtracking
Because of their occasional need to return to shallow points in a search tree, existing backtracking methods can sometimes erase meaningful progress toward solving a search problem. In this paper, we present a method by which backtrack points can be moved deeper in the search space, thereby avoiding this di culty. The technique developed is a variant of dependency-directed backtracking that use...
متن کامل